Concurrency in snap-stabilizing local resource allocation

Concurrency in Snap-Stabilizing Local Resource Allocation

In distributed systems, resource allocation consists in managing fair access of a large number of processes to a typically small number of reusable resources. As soon as the number of available resources is greater than one, the efficiency in concurrent accesses becomes an important issue, as a crucial goal is to maximize the utilization rate of resources. In this paper, we tackle the concurren...

Probabilistic Snap-Stabilizing Algorithms for Local Resource Allocation Problems

Scientific Context. Modern networks are very large-scale (about 100 000 nodes). Now, the more a network contains nodes, the greater the probability of failures is. Hence, today fault-tolerance is a main concern for distributed algorithm designers. In particular, since several decades, there is a growing interest for self-repairing methods. For example, (deterministic) self-stabilization [Dij74]...

Local Public Health Resource Allocation

Results: Local decision-making authority was perceived as greatly restricted by what public health activities were legally mandated and the categoric nature of funding sources, even as some leaders exercised deliberate strategic approaches. One’s workforce and board of health were also influential in making decisions regarding resource allocations. Challenges were expressed regarding making use...

Optimal Snap - Stabilizing Neighborood Synchronizerin

Snap-Stabilizing Detection of Cutsets

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol which detects if a set of processors is a cutset of an arbitrary rooted network. This protocol is based on the depth-first search ( ) traversal and its properties. An interesting property of our protocol is that, despite the initial c...